Successive Wyner-Ziv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem
نویسندگان
چکیده
We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinement. For the quadratic Gaussian CEO problem, we establish a necessary and sufficient condition for distributed successive refinement, where the successive Wyner-Ziv coding scheme plays an important role.
منابع مشابه
Successively Structured CEO Problems
Successive encoding strategies are developed for some prototype sensor network problems based on generalized Wyner-Ziv encoding. Their performance is analyzed for quadratic-Gaussian versions of both a new serially structured CEO problem as well as the classical CEO problem.
متن کاملSuccessive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss
An l-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graphbased codes. A successive coding scheme is proposed for converting an l-link binary CEO problem to the (2l − 1) single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically ach...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملJoint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation
The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel’fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by a applying modulo-...
متن کاملSuccessive structuring of source coding algorithms for data fusion, buffering, and distribution in networks
Numerous opportunities to improve network performance present themselves when we make communication networks aware of the characteristics of the data content they are handling. In this thesis, we design such content-aware algorithms that span traditional network layers and are successively structured, focusing on problems of data fusion, buffering, and distribution. The successive structuring o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 54 شماره
صفحات -
تاریخ انتشار 2008